Iterative Lexicographic Path Orders
نویسندگان
چکیده
We relate Kamin and Lévy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem. Dedicated to Joseph Goguen, in celebration of his 65th birthday.
منابع مشابه
Iterative path orders
In Dershowitz’s original presentation recursive path orders (RPO) are defined by means of recursion. In Bergstra and Klop’s presentation RPOs are operationally defined by means of a set of term rewrite rules. To distinguish the two presentations, we will refer to the latter as iterative path orders (IPO). We show that IPOs as originally defined by Bergstra and Klop are strictly weaker than RPOs...
متن کاملPredicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions
The predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order, is presented. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. It can be shown that PLPOs however onl...
متن کاملPredicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions
In this paper we present a novel termination order the predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. I...
متن کاملAn Application of Term Rewriting to the Region of Primitive Recursive Functions
In this paper we present a novel termination order the predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. I...
متن کاملRecursively Deened Quasi Orders on Terms
We study the problems involved in the recursive de nition of (quasi) orders on terms, focussing on the question of establishing well-de nedness, and the properties required for partial and quasi-orders: irre exivity and transitivity, and re exivity and transitivity, respectively. These properties are in general di cult to establish and this has in many cases come down in the literature as folkl...
متن کامل